Information Ranking and Power Laws on Trees
نویسندگان
چکیده
We consider the stochastic analysis of information ranking algorithms of large interconnected data sets, e.g. Google’s PageRank algorithm for ranking pages on the World Wide Web. The stochastic formulation of the problem results in an equation of the form R D = Q+ N X
منابع مشابه
Evaluation of Tree Marking in Persian Ironwood-hornbeam Stands at Bahramnia Forestry Plan and Its Effect on Stand Structure
Tree marking can cause changes in forest. This study aimed to assess tree marking operation and to predict its effect on stand structure of Persian ironwood-hornbeam stands at Bahramnia forestry plan, north of Iran. Therefore 98 trees that were marked in compartment 9 of the mentioned forest in 2017 based on selection system and according to the recent laws of Forests, Range and Watershed Manag...
متن کاملUsing Lotkaian Informetrics for Ranking in Digital Libraries
The purpose of this paper is to propose the use of models, theories and laws in bibliometrics and scientometrics to enhance information retrieval processes, especially ranking. A common pattern in many man-made data sets is Lotka’s Law which follows the well-known power-law distributions. These informetric distributions can be used to give an alternative order to large and scattered result sets...
متن کاملDetermining Factors Behind the PageRank Log-Log Plot
We study the relation between PageRank and other parameters of information networks such as in-degree, out-degree, and the fraction of dangling nodes. We model this relation through a stochastic equation inspired by the original definition of PageRank. Further, we use the theory of regular variation to prove that PageRank and in-degree follow power laws with the same exponent. The difference be...
متن کاملThe measurement of ranks and the laws of iterated contraction
Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper shows how to reconstruct a ranking function from its iterated contraction behavior uniquely up to multiplicative constant and thus how to measure ranks on a ratio scale. Thereby, it also shows how to completely axiomatize that behavior. The complete set o...
متن کاملImproving Ranking Using Quantum Probability
Data management systems, like database, information extraction, information retrieval or learning systems, store, organize, index, retrieve and rank information units, such as tuples, objects, documents, items to match a pattern (e.g. classes and profiles) or meet a requirement (e.g., relevance, usefulness and utility). To this end, these systems rank information units by probability to decide ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0905.1738 شماره
صفحات -
تاریخ انتشار 2009